In Vitro Fertilization Genetic Algorithm Applied To Multidimensional 0-1 Knapsack Problem
نویسندگان
چکیده
In Vitro Fertilization Genetic Algorithm (IVF/GA) is a recently created algorithm that combine the concepts of Genetic Algorithm and In Vitro Fertilization. The IVF/GA has the aim to improve the performance of Genetic Algorithm with the addition of IVF-Inspired mechanisms that better exploit the information of individuals. The Multimensional Knapsack Problem (MKP) is a complex combinatorial problem (NP-hard) and therefore has been addressed in some papers. Thus, this paper applied the IVF/GA, Canonical GA and GA/Busca Tabu to MKP and compared the results. The IVF/GA was the best of them on analyzed instances and therefore we can conclude that IVF/GA is a promising algorithm.
منابع مشابه
A Fuzzy Genetic Algorithm Based on Binary Encoding for Solving Multidimensional Knapsack Problems
The fundamental problem in genetic algorithms is premature convergence, and it is strongly related to the loss of genetic diversity of the population. This study aims at proposing some techniques to tackle the premature convergence by controlling the population diversity. Firstly, a sexual selection mechanism which utilizes the mate chromosome during selection is used. The second technique focu...
متن کاملSimulated Annealing for the 0/1 Multidimensional Knapsack Problem
In this paper a simulated annealing (SA) algorithm is presented for the 0/1 multidimensional knapsack problem. Problem-specific knowledge is incorporated in the algorithm description and evaluation of parameters in order to look into the performance of finite-time implementations of SA. Computational results show that SA performs much better than a genetic algorithm in terms of solution time, w...
متن کاملA Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem
The 0-1 multidimensional knapsack problem (MKP) is a well-known combinatorial optimization problem with several real-life applications, for example, in project selection. Genetic algorithms (GA) are effective heuristics for solving the 0-1 MKP. Multiple individual GAs with specific characteristics have been proposed in literature. However, so far, these approaches have only been partially compa...
متن کاملGenetic Algorithms for 0/1 Multidimensional Knapsack Problems
An important class of combinatorial optimization problems are the Multidimensional 0/1 Knapsacks, and various heuristic and exact methods have been devised to solve them. Among these, Genetic Algorithms have emerged as a powerful new search paradigms. We show how a proper selection of parameters and search mechanisms lead to an implementation of Genetic Algorithms that yields high quality solut...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کامل